• Home
  • Experiments
    • Process Scheduling
      • Experiment No 1 : First Come First Serve
      • Experiment No 2 : Shortest Job First
      • Experiment No 3 : Round Robin
      • Experiment No 4 : Preemptive Priority
      • Experiment No 5 : Non-Preemptive Priority
      • Experiment No 6 : Shortest Remaining Time First
    • Banker's Algorithm
    • Disk Scheduling        
      • Experiment No 1 : First Come First Serve
      • Experiment No 2 : Shortest Seek Time First
      • Experiment No 3 : SCAN
      • Experiment No 4 : CSCAN
      • Experiment No 5 : LOOK
      • Experiment No 6 : CLOOK
    • Process Synchronization
      • Experiment No 1 : Counting Semaphores
      • Experiment No 2 : Binary Semaphores
  • Discussion Forum
  • About Us
  • Feedback
  • Logout



Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Process Scheduling

Experiment No. 1
First Come
First Serve

Experiment No. 2
Shortest Job First Scheduling

Experiment No. 3
Round Robin
Scheduling

Experiment No. 4
Preemptive Priority
Scheduling

Experiment No. 5
Non-Preemptive Priority
Scheduling

Experiment No. 6
Shortest Remaining Time First

1 2 3 4 5 6

Department Of Computer Engineering
2022-23

Guided by : Prof. Jyoti Wadmare
Developed by : Dakshita Kolte, Kapil Bhatia, Palak Desai, Kartikeya Dangat